Complexity classes

Results: 1120



#Item
71Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values Benjamin Mood Yale University

Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values Benjamin Mood Yale University

Add to Reading List

Source URL: work.debayangupta.com

Language: English - Date: 2014-08-25 13:51:41
72Economics and Computation ECONand CPSCProfessor Dirk Bergemann and Professor Joan Feigenbaum Lecture IV

Economics and Computation ECONand CPSCProfessor Dirk Bergemann and Professor Joan Feigenbaum Lecture IV

Add to Reading List

Source URL: zoo.cs.yale.edu

Language: English - Date: 2008-10-07 04:07:53
73Spectral Graph Theory and Applications  WSLecture 9: Undirected Connectivity in Log-Space Lecturer: Thomas Sauerwald & He Sun

Spectral Graph Theory and Applications WSLecture 9: Undirected Connectivity in Log-Space Lecturer: Thomas Sauerwald & He Sun

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2012-01-13 07:00:53
74Knowledge representation / Corpora / Complexity classes / Syntax / VerbNet / Semiotics / FrameNet / Theta role / Frame language / P versus NP problem / NP

Overview This newest release of VerbNet contains several significant changes: The addition of over 300 new verb lemmas, including some highly frequent verbs, such as own and seem. The addition of over 300 new senses of

Add to Reading List

Source URL: verbs.colorado.edu

Language: English - Date: 2009-08-21 15:02:48
75Metaheuristics / Complexity classes / Operations research / Mathematical optimization / Tabu search / Algorithm / Search algorithm / Heuristic / Local search / Theorem / NP

E. Sakalauskas The Multivariate Quadratic Power Problem over ZN is NP-Complete N. Surname Application of Multistart Tabu Search to the MAX–CUT Problem N. Surname

Add to Reading List

Source URL: www.itc.ktu.lt

Language: English - Date: 2015-05-26 03:12:57
761  Doc. Math. J. DMV Games, Complexity Classes, and Approximation Algorithms Joan Feigenbaum

1 Doc. Math. J. DMV Games, Complexity Classes, and Approximation Algorithms Joan Feigenbaum

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2001-10-24 10:52:24
77Lecture Notes for Ph219/CS219: Quantum Information Chapter 5 John Preskill California Institute of Technology Updated July 2015

Lecture Notes for Ph219/CS219: Quantum Information Chapter 5 John Preskill California Institute of Technology Updated July 2015

Add to Reading List

Source URL: www.theory.caltech.edu

Language: English - Date: 2015-07-24 12:47:46
78Smoothed Complexity Theory Markus Bl¨aser1 and Bodo Manthey2 1 Saarland University,  2

Smoothed Complexity Theory Markus Bl¨aser1 and Bodo Manthey2 1 Saarland University, 2

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Language: English - Date: 2014-01-17 04:45:53
79Theoretical Computer Science–2863  Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs

Theoretical Computer Science–2863 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2014-11-26 08:32:25
80c 2004 Cambridge University Press Combinatorics, Probability and Computing, 1–16.  DOI: S0963548303005844 Printed in the United Kingdom Approximating the Number of Acyclic Orientations for a Class of

c 2004 Cambridge University Press Combinatorics, Probability and Computing, 1–16.  DOI: S0963548303005844 Printed in the United Kingdom Approximating the Number of Acyclic Orientations for a Class of

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2004-03-11 06:32:34